A General Label Search to investigate classical graph search algorithms
نویسندگان
چکیده
منابع مشابه
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic process called General Label Search (GLS), which uses a labeling structure which, when specified, defines specific algorithms. We characterize the vertex orderings computable by the basic types of searches in terms of prope...
متن کاملCooperative search vs classical algorithms
We have presented, in a previous work ([15]), a cooperative parallel search for solving the constraint satisfaction problem. We run independently solvers based on Forward-Checking with Nogood Recording. The solvers exchange nogoods via a process (”the manager of nogoods”) which regulates the exchanges. Solvers exploit the nogoods they receive to limit the size of their search tree. Experimental...
متن کاملFast Graph-Search Algorithms for General Aviation Flight Trajectory Generation
We consider numerical algorithms for on-board flight trajectory generation and optimization in three dimensional space. Our approach relies on graph search algorithms, which perform a global search over the set of feasible trajectories. We start by formulating a simplified kinematic model that is appropriate for General Aviation aircraft. The cost function to be optimized includes, the cost fun...
متن کاملNeMa: Fast Graph Search with Label Similarity
It is increasingly common to find real-life data represented as networks of labeled, heterogeneous entities. To query these networks, one often needs to identify the matches of a given query graph in a (typically large) network modeled as a target graph. Due to noise and the lack of fixed schema in the target graph, the query graph can substantially differ from its matches in the target graph i...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.02.011